A Rich Vehicle Routing Problem for a City Logistics Problem

In this work, a Rich Vehicle Routing Problem (RVRP) is faced for solving city logistic problems. particular, we deal with the problem of company that has to define best distribution strategy obtaining an efficient usage vehicles and reducing transportation costs while serving customers different priority demands during given planning horizon. Thus, multi-period vehicle routing heterogeneous fleet vehicles, customers’ requirements restrictions satisfy, in which composition be daily defined. fact, owned possibility select, day by day, certain number from third-party company. must minimized together used. A mixed integer programming model proposed, experimental campaign presented validating it. Tests have been used evaluating quality solutions terms both behavior service level grant customers. Moreover, benefits can obtained postponing deliveries are evaluated. Results discussed, some conclusions highlighted, including formulating such way as use general solver proposed recent literature. This seems most interesting challenge permit companies improve activities.